Merging Partially Consistent Maps
نویسندگان
چکیده
Learning maps from sensor data has been addressed since more than two decades by Simultaneous Localization and Mapping (SLAM) systems. Modern state-of-the-art SLAM approaches exhibit excellent performances and are able to cope with environments having the scale of a city. Usually these methods are entailed for on-line operation, requiring the data to be acquired in a single run, which is not always easy to obtain. To gather a single consistent map of a large environment we therefore integrate data acquired in multiple runs. A possible solution to this problem consists in merging different submaps. The literature proposes several approaches for map merging, however very few of them are able to operate with local maps affected by inconsistencies. These methods seek to find the global arrangement of a set of rigid bodies, that maximizes some overlapping criterion. In this paper, we present an off-line technique for merging maps affected by residual errors into a single consistent global map. Our method can be applied in combination with existing map merging approaches, since it requires an initial guess to operate. However, once this initial guess is provided, our method is able to substantially lessen the residual error in the final map. We validated our approach on both real world and simulated datasets to refine solutions of traditional map merging approaches.
منابع مشابه
Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملTopological Map Merging
When multiple robots cooperatively explore an environment, maps from individual robots must be merged to produce a single globally consistent map. This is a difficult problem when the robots do not have a common reference frame or global positioning. In this paper, we describe an algorithm for merging embedded topological maps. Topological maps provide a concise description of the navigability ...
متن کاملAdaptive Merging of Prioritized Knowledge Bases
In this paper, we propose an adaptive algorithm for merging n (n≥2) prioritized knowledge bases which takes into account the degrees of conflict and agreement among these knowledge bases. The algorithm first selects largely partially maximal consistent subsets (LPMCS) of sources by assessing how (partially) consistent the information in the subset is. Then within each of these created subsets, ...
متن کاملThe International Journal of Robotics Research
When multiple robots cooperatively explore an environment, maps from individual robots must be merged to produce a single globally consistent map. This is a challenging problem when the robots do not have a common reference frame or global positioning. In this paper, we describe an algorithm for merging embedded topological maps. Topological maps provide a concise description of the navigabilit...
متن کاملOn the accurate construction of consensus genetic maps.
We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The problem is to build a consensus map, which includes and is consistent with all (or, the vast majority of) the markers in the individual maps. When markers in the input maps have ordering conflicts, the resulting consensus map will contain cycles. We formulate the problem of r...
متن کامل